Distances in benzenoid systems: Further developments

نویسندگان

  • Victor Chepoi
  • Sandi Klavzar
چکیده

In this note we present some new results on distances in benzenoids. An algorithm is presented which, for a given benzenoid system G bounded by a simple circuit 2 with n vertices, computes the Wiener index of G in O(n) time. Also we show that benzenoid systems have a convenient dismantling scheme, which can be derived by applying breadth-first search to their dual graphs. Our last result deals with the clustering problem of sets of atoms of benzenoids systems. We show how the k-means clustering algorithm (for points in Euclidean space) can be efficiently implemented in the case of benzenoids. @ 1998 Elsevier Science B.V. All rights reserved

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Edge-Szeged and vertex-PIindices of Some Benzenoid Systems

The edge version of Szeged index and vertex version of PI index are defined very recently. They are similar to edge-PI and vertex-Szeged indices, respectively. The different versions of Szeged and PIindices are the most important topological indices defined in Chemistry. In this paper, we compute the edge-Szeged and vertex-PIindices of some important classes of benzenoid systems.

متن کامل

On discriminativity of vertex-degree-based indices

A recently published paper [T. Došlić, this journal 3 (2012) 25-34] considers the Zagreb indices of benzenoid systems, and points out their low discriminativity. We show that analogous results hold for a variety of vertex-degree-based molecular structure descriptors that are being studied in contemporary mathematical chemistry. We also show that these results are straightforwardly obtained by u...

متن کامل

On Distances in Benzenoid Systems

We show that the molecular graph G of a benzenoid hydrocarbon admits an isometric embedding into the Cartesian product of three trees T1, T2, and T3 defined by three directions of the host hexagonal grid. Namely, to every vertex V of G one can associate an ordered triplet (V1, V2, V3) with Vi being a vertex of Ti (i ) 1, 2, 3), such that the graph-theoretic distance between two vertices u, V of...

متن کامل

An Algorithm for the Calculation of the Szeged Index of Benzenoid Hydrocarbons

The Szeged index (Sz) is a recently proposed1q2 structural descriptor, based on the distances of the vertices of the molecular graph. In order to be able to study the properties of this novel topological index it would be advantageous to possess an easy method for its calculation. The calculation of Sz directly from its definition (see below) is quite cumbersome, especially in the case of large...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 192  شماره 

صفحات  -

تاریخ انتشار 1998